Dynamic Behavior of Tcp-like Window Control and Throughput Performance

In this paper, we consider a TCP-like sliding window control with delayed information. We propose a deterministic fluid-flow queueing system which represents a situation where many T C P connections share a bottleneck link of ATM networks. We provide various properties of the transmission rate function (which is a function of time) to ensure that, with the analytical model, we can compute the throughput performance of T C P over ATM networks. Numerical results show that the synchronization of TCP window control yields heavy degradation of the throughput performance. Further we observe that the throughput is not a continuous function of the peak rate and there exist some regions where the behavior of the throughput has different characteristics. Such complex behavior of the throughput is caused by the complex behavior of the window control.